The strong chromatic index of graphs and subdivisions
نویسندگان
چکیده
منابع مشابه
The Strong Chromatic Index of Random Graphs
The strong chromatic index of a graph G, denoted by χs(G), is the minimum number of colors needed to color its edges so that each color class is an induced matching. In this paper we analyze the asymptotic behavior of this parameter in a random graph G(n, p), for two regions of the edge probability p = p(n). For the dense case, where p is a constant, 0 < p < 1, we prove that with high probabili...
متن کاملThe Strong Chromatic Index of Graphs
The strong chromatic index of graphs Mohammad Mahdian Master of Science Graduate Department of C o m p t e r Science University of Toronto 2000 A strong edge-colouring of a graph G is an assignrnent of colours to the edges of G such that every colour class is an induced matching. The minimum number of colours in such a colouring is called the strong chromatic index of G. In 1985, Erdos and Nese...
متن کاملThe strong chromatic index of Halin graphs
The Strong Chromatic Index of Halin Graphs By Ziyu Hu A strong edge coloring of a graph G is an assignment of colors to the edges of G such that two distinct edges are colored differently if they have adjacent endpoints. The strong chromatic index of a graph G, denoted by χs(G), is the minimum number of colors needed for a strong edge coloring of G. A Halin graph G is a planar graph constructed...
متن کاملStrong Chromatic Index of Products of Graphs
The strong chromatic index of a graph is the minimum number of colours needed to colour the edges in such a way that each colour class is an induced matching. In this paper, we present bounds for the strong chromatic index of three different products of graphs in terms of the strong chromatic index of each factor. For the Cartesian product of paths, cycles or complete graphs, we derive sharper ...
متن کاملStrong chromatic index of chordless graphs
A strong edge colouring of a graph is an assignment of colours to the edges of the graph such that for every colour, the set of edges that are given that colour form an induced matching in the graph. The strong chromatic index of a graph G, denoted by χ s (G), is the minimum number of colours needed in any strong edge colouring of G. A graph is said to be chordless if there is no cycle in the g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2014
ISSN: 0012-365X
DOI: 10.1016/j.disc.2013.11.005